Finitely Bounded Effective Computability
نویسنده
چکیده
One of the most important property of the computability is the certainty. For example a set of natural numbers is computable if there is a Turing machine which decides certainly if a given natural number belongs to the set or not, and no wrong answers are tolerant. On the other hand, the finitely bounded computability discussed in this paper allows finitely many mistakes which can be eventually corrected during an effective procedure. We will show especially that the class of finitely bounded computable real numbers has very interesting properties, and it is a real closed field containing even properly in the class of d-c.e. real numbers.
منابع مشابه
Effective categoricity of equivalence structures
We investigate effective categoricity of computable equivalence structures A. We show that A is computably categorical if and only if A has only finitely many finite equivalence classes, or A has only finitely many infinite classes, bounded character, and at most one finite k such that there are infinitely many classes of size k. We also prove that all computably categorical structures are rela...
متن کاملIsometries and Computability Structures
We investigate the relationship between computable metric spaces (X, d, α) and (X, d, β), where (X, d) is a given metric space. In the case of Euclidean space, α and β are equivalent up to isometry, which does not hold in general. We introduce the notion of effectively dispersed metric space and we use it in the proof of the following result: if (X, d,α) is effectively totally bounded, then (X,...
متن کاملStability of representations of effective partial algebras
An algebra is effective if its operations are computable under some numbering. When are two numberings of an effective partial algebra equivalent? For example, the computable real numbers form an effective field and two effective numberings of the field of computable reals are equivalent if the limit operator is assumed to be computable in the numberings (theorems of Moschovakis and Hertling). ...
متن کاملPerfect Local Computability and Computable Simulations
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that every such S can be simulated, in a strong sense and even over arbitrary finite parameter sets, by a computable structure. We also study the category theory of a perfect cover of S, examining its connections to the categ...
متن کاملOn Finitely Presented Expansions of Computably Enumerable Semigroups
Every computable universal algebra has a finitely presented expansion, but there are examples of finitely generated, computably enumerable universal algebras with no finitely presented expansions. It is natural to ask whether such examples can be found in well-known classes of algebras such as groups and semigroups. In this paper, we build an example of a finitely generated, infinite, computabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 202 شماره
صفحات -
تاریخ انتشار 2008